Regularization of Large Scale Total Least Squares Problems
نویسندگان
چکیده
The total least squares (TLS) method is an appropriate approach for linear systems when not only the right-hand side but also the system matrix is contaminated by some noise. For ill-posed problems regularization is necessary to stabilize the computed solutions. In this presentation we discuss two approaches for regularizing large scale TLS problems. One which is based on adding a quadratic constraint and a Tikhonov type regularization concept.
منابع مشابه
Large-scale Tikhonov regularization of total least squares
The total least squares (TLS) method is a successful approach for linear problems when not only the right-hand side but the system matrix as well are contaminated by some noise. For ill-posed TLS problems regularization is necessary to stabilize the computed solution. In this paper we present a new approach for computing an approximate solution of the Tikhonov-regularized large-scale total leas...
متن کاملRegularization of Large-scale Ill-conditioned Least Squares Problems Regularization of Large{scale Ill{conditioned Least Squares Problems
Ill{conditioned problems arise in important areas like geophysics, medical imaging and signal processing. The fact that the ill{cond-itioning is an intrinsic feature of these problems makes it necessary to develop special numerical methods to treat them. Regularization methods belong to this class. The lack of robust regularization methods for large{scale ill{cond-itioned problems motivated thi...
متن کاملLarge-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملTikhonov Regularization and Total Least Squares
Discretizations of inverse problems lead to systems of linear equations with a highly ill-conditioned coefficient matrix, and in order to compute stable solutions to these systems it is necessary to apply regularization methods. We show how Tikhonov’s regularization method, which in its original formulation involves a least squares problem, can be recast in a total least squares formulation sui...
متن کاملAn Efficient Iterative Approach for Large-Scale Separable Nonlinear Inverse Problems
This paper considers an efficient iterative approach to solve separable nonlinear least squares problems that arise in large scale inverse problems. A variable projection GaussNewton method is used to solve the nonlinear least squares problem, and Tikhonov regularization is incorporated using an iterative Lanczos hybrid scheme. Regularization parameters are chosen automatically using a weighted...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011